minimum vertex cover problem 最小顶点涵盖问题
·2,447,543篇论文数据，部分数据来源于NoteExpress
The problem of seeking monitor-nodes for measuring the network traffic is regarded as the problem of finding out the minimum weak vertex cover of a graph which is NP-hard.
网络流量监测点问题可以抽象为图的最小弱顶点覆盖问题，而求解最小弱顶点覆盖问题是一个NP难题。
youdao
应用推荐
模块上移
模块下移
不移动